Principle Based Semantics for HPSG

The paper presents a constraint based semantic formalism for HPSG. The advantages of the formlism are shown with respect to a grammar for a fragment of German that deals with (i) quantifier scope ambiguities triggered by scrambling and/or movement and (ii) ambiguities that arise from the collective/distributive distinction of plural NPs. The syntax-semantics interface directly implements syntactic conditions on quantifier scoping and distributivity. The construction of semantic representations is guided by general principles governing the interaction between syntax and semantics. Each of these principles acts as a constraint to narrow down the set of possible interpretations of a sentence. Meanings of ambiguous sentences are represented by single partial representations (so-called U(nderspecified) D(iscourse) R(epresentation) S(tructure)s) to which further constraints can be added monotonically to gain more information about the content of a sentence. There is no need to build up a large number of alternative representations of the sentence which are then filtered by subsequent discourse and world knowledge. The advantage of UDRSs is not only that they allow for monotonic incremental interpretation but also that they are equipped with truth conditions and a proof theory that allows for inferences to be drawn directly on structures where quantifier scope is not resolved

Chromium silicide formation by ion mixing

The formation of CrSi_2 by ion mixing was studied as a function of temperature, silicide thickness and irradiated interface. Samples were prepared by annealing evaporated couples of Cr on Si and Si on Cr at 450°C for short times to form Si/CrSi_2/Cr sandwiches. Xenon beams with energies up to 300 keV and fluences up to 8 X 10^15 cm^(-2) were used for mixing at temperatures between 20 and 300°C. Penetrating only the Cr/CrSi_2 interface at temperatures above 150°C induces further growth of the silicide as a uniform stoichiometric layer. The growth rate does not depend on the thickness of the initially formed silicide at least up to a thickness of 150 nm. The amount of growth depends linearly on the density of energy deposited at the interface. The growth is temperature dependent with an apparent activation energy of 0.2 eV. Irradiating only through the Si/CrSi_2 interface does not induce silicide growth. We conclude that the formation of CrSi_2 by ion beam mixing is an interface-limited process and that the limiting reaction occurs at the Cr/CrSi_2 interface

Electrochemistry of Dihalogenated Nicotonic Acids in Aqueous and Aprotic Media

The electrochemical reduction of several 2,5- and 5,6- dihalonicotinic acids have been studied in dimethyl sulfoxide as well as in aqueous buffers of different pH. The polarographic half-wave potentials for the reduction of these compounds in both media are reported here. The compounds appear to reduce at the carboxyl group. The presence of halogen atoms on the pyridine ring facilitates reduction

X-ray emission from Planetary Nebulae. I. Spherically symmetric numerical simulations

(abridged) The interaction of a fast wind with a spherical Asymptotic Giant Branch (AGB) wind is thought to be the basic mechanism for shaping Pre-Planetary Nebulae (PPN) and later Planetary Nebulae (PN). Due to the large speed of the fast wind, one expects extended X-ray emission from these objects, but X-ray emission has only been detected in a small fraction of PNs and only in one PPN. Using numerical simulations we investigate the constraints that can be set on the physical properties of the fast wind (speed, mass-flux, opening angle) in order to produce the observed X-ray emission properties of PPNs and PNs. We combine numerical hydrodynamical simulations including radiative cooling using the code FLASH with calculations of the X-ray properties of the resulting expanding hot bubble using the atomic database ATOMDB. In this first study, we compute X-ray fluxes and spectra using one-dimensional models. Comparing our results with analytical solutions, we find some agreements and many disagreements. In particular, we test the effect of different time histories of the fast wind on the X-ray emission and find that it is determined by the final stage of the time history during which the fast wind velocity has its largest value. The disagreements which are both qualitative and quantitative in nature argue for the necessity of using numerical simulations for understanding the X-ray properties of PNs.Comment: 17 pages, accepted for publication in ApJ (July 27, 2006), uses emulateap

Maladaptation and the paradox of robustness in evolution

Background. Organisms use a variety of mechanisms to protect themselves against perturbations. For example, repair mechanisms fix damage, feedback loops keep homeostatic systems at their setpoints, and biochemical filters distinguish signal from noise. Such buffering mechanisms are often discussed in terms of robustness, which may be measured by reduced sensitivity of performance to perturbations. Methodology/Principal Findings. I use a mathematical model to analyze the evolutionary dynamics of robustness in order to understand aspects of organismal design by natural selection. I focus on two characters: one character performs an adaptive task; the other character buffers the performance of the first character against perturbations. Increased perturbations favor enhanced buffering and robustness, which in turn decreases sensitivity and reduces the intensity of natural selection on the adaptive character. Reduced selective pressure on the adaptive character often leads to a less costly, lower performance trait. Conclusions/Significance. The paradox of robustness arises from evolutionary dynamics: enhanced robustness causes an evolutionary reduction in the adaptive performance of the target character, leading to a degree of maladaptation compared to what could be achieved by natural selection in the absence of robustness mechanisms. Over evolutionary time, buffering traits may become layered on top of each other, while the underlying adaptive traits become replaced by cheaper, lower performance components. The paradox of robustness has widespread implications for understanding organismal design

A storage and access architecture for efficient query processing in spatial database systems

Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and access architecture with respect to efficient query processing. Performance improving concepts such as spatial storage and access structures, approximations, object decompositions and multi-phase query processing have been suggested and analyzed as single building blocks. In this paper, we describe a storage and access architecture which is composed from the above building blocks in a modular fashion. Additionally, we incorporate into our architecture a new ingredient, the scene organization, for efficiently supporting set-oriented access of large-area region queries. An experimental performance comparison demonstrates that the concept of scene organization leads to considerable performance improvements for large-area region queries by a factor of up to 150

Distance and the pattern of intra-European trade

Given an undirected graph G = (V, E) and subset of terminals T ⊆ V, the element-connectivity κ ′ G (u, v) of two terminals u, v ∈ T is the maximum number of u-v paths that are pairwise disjoint in both edges and non-terminals V \ T (the paths need not be disjoint in terminals). Element-connectivity is more general than edge-connectivity and less general than vertex-connectivity. Hind and Oellermann [21] gave a graph reduction step that preserves the global element-connectivity of the graph. We show that this step also preserves local connectivity, that is, all the pairwise element-connectivities of the terminals. We give two applications of this reduction step to connectivity and network design problems. • Given a graph G and disjoint terminal sets T1, T2,..., Tm, we seek a maximum number of elementdisjoint Steiner forests where each forest connects each Ti. We prove that if each Ti is k element k connected then there exist Ω( log hlog m) element-disjoint Steiner forests, where h = | i Ti|. If G is planar (or more generally, has fixed genus), we show that there exist Ω(k) Steiner forests. Our proofs are constructive, giving poly-time algorithms to find these forests; these are the first non-trivial algorithms for packing element-disjoint Steiner Forests. • We give a very short and intuitive proof of a spider-decomposition theorem of Chuzhoy and Khanna [12] in the context of the single-sink k-vertex-connectivity problem; this yields a simple and alternative analysis of an O(k log n) approximation. Our results highlight the effectiveness of the element-connectivity reduction step; we believe it will find more applications in the future